Projection of state space realizations
نویسندگان
چکیده
1.0.1 Description of the problem We consider two m × p strictly proper transfer functions T (s) = C(sI n − A) −1 B, ˆ T (s) = ˆ C(sI k − ˆ A) −1ˆB, (1.1) of respective Mc Millan degrees n and k < n. We are interested in finding the necessary and sufficient conditions for the existence of projecting matrices Z, V ∈ C n×k such that and in characterizing the set of all transfer functionsˆT (s) that can be obtained via the projection equations (1.1,1.2). Only the image of the projecting matrices Z and V are important since choosing other bases satisfying the bi-orthogonality condition (1.2) amounts to a state-space transformation of the realization ofˆT (s). 1.0.2 Motivation and history of the problem Equation (1.2) arises naturally in the general framework of model reduction of large scale linear systems [1]. In this context we are given a transfer function T (s) of Mc Millan degree n which we want to approximate by a transfer function 1
منابع مشابه
Minimal state space realization for all-pole and all-zero lattice discrete 2D filters
In this paper state space realizations for all-pole and all-zero two-dimensional (2D) lattice discrete ®lters are presented. The proposed realizations are based on the corresponding circuit implementations. For the realizations, the 2D state space model of the Roesser type was used. The dimension of the state vector was minimal. Three low-order examples are presented to illustrate the proposed ...
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملOptimal Fwl Design of State - Space Digital Systems with Weighted Sensitivity Lminimization - - - - and Sparseness Consideration
The optimal Finite Word Length (FWL) state-space digital system design problem is investigated. It is argued that it may be desirable to minimize a frequency weighted sensitivity measure over all similarity transformations. The set of optimal realizations minimizing this weighted sensitivity is completely characterized. It is shown that a subset of the optimal realization set consists of sparse...
متن کاملThe (J, J )–Spectral Factorization of a General Discrete–Time System
For a discrete–time system whose transfer matrix function is completely general (arbitrary normal rank, strictly proper/imprope/polynomial, with poles and zeroes on the unit circle) we give existence conditions and constructive formulas for the (J, J ′)–spectral factor. The computation of the spectral factor is done by employing generalized state–space realizations and numerically–sound algorit...
متن کاملThe positive real lemma and construction of all realizations of generalized positive rational functions
We here extend the well known Positive Real Lemma (also known as the Kalman-Yakubovich-Popov Lemma) to complex matrix-valued generalized positive rational function, when non-minimal realizations are considered. All state space realizations are partitioned into subsets, each is identified with a set of matrices satisfying the same Lyapunov inclusion. Thus, each subset forms a convex invertible c...
متن کامل